Convergence and round-off errors in a two-dimensional eigenvalue problem using spectral methods and Arnoldi-chebyshev algorithm
نویسندگان
چکیده
An efficient way of solving 2D stability problems in fluid mechanics is to use, after discretization of the equations that cast the problem in the form of a generalized eigenvalue problem, the incomplete Arnoldi-Chebyshev method. This method preserves the banded structure sparsity of matrices of the algebraic eigenvalue problem and thus decreases memory use and CPU-time consumption. The errors that affect computed eigenvalues and eigenvectors are due to the truncation in the discretization and to finite precision in the computation of the discretized problem. In this paper we analyze those two errors and the interplay between them. We use as a test case the twodimensional eigenvalue problem yielded by the computation of inertial modes in a spherical shell. This problem contains many difficulties that make it a very good test case. It turns out that that single modes (especially most-damped modes i.e. with high spatial frequency) can be very sensitive to round-off errors, even when apparently good spectral convergence is achieved. The influence of round-off errors is analyzed using the spectral portrait technique and by comparison of double precision and extended precision computations. Through the analysis we give practical recipes to control the truncation and round-off errors on eigenvalues and eigenvectors.
منابع مشابه
A Krylov Method for the Delay Eigenvalue Problem
The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem (DEP). The DDE can equivalently be expressed with a linear infinite dimensional operator whose eigenvalues are the solutions...
متن کاملSome new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملMemory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis
Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the standard monomial basis for a larger degree d. The standard way of solving polynomial eigenvalue problems proceeds by linearization, which in...
متن کاملAn Arnoldi like method for the delay eigenvalue problem
The method called Arnoldi is currently a very popular method to solve largescale eigenvalue problems. The general purpose of this paper is to generalize Arnoldi to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem. The DDE can equivalently be expressed with a linear infinite dimensional operator which eigenvalues are the solutions to the ...
متن کاملKrylov Methods for Nonlinear Eigenvalue Problems
We present two generalisations of the Krylov subspace method, Arnoldi for the purpose of applying them to nite dimensional eigenvalue problems nonlinear in the eigenvalue parameter. The rst method is called nonlinear rational Krylov subspace and approximates and updates the projection of a linearised problem by nesting a one-sided secant method with Arnoldi. The second method, called nonlinear ...
متن کامل